Piles of Cubes, Monotone Path Polytopes, and Hyperplane Arrangements
نویسنده
چکیده
Monotone path polytopes arise as a special case of the construction of ber polytopes, introduced by Billera and Sturmfels. A simple example is provided by the permutahedron, which is a monotone path polytope of the standard unit cube. The permutahedron is the zonotope polar to the braid arrangement. We show how the zonotopes polar to the cones of certain deformations of the braid arrangement can be realized as monotone path polytopes. The construction is an extension of that of the permutahedron and yields interesting connections between enumerative combinatorics of hyperplane arrangements and geometry of monotone path polytopes.
منابع مشابه
Ff Ur Mathematik in Den Naturwissenschaften Leipzig Hyperplane Arrangements Separating Arbitrary Vertex Classes in N-cubes Hyperplane Arrangements Separating Arbitrary Vertex Classes in N-cubes
Strictly layered feedforward networks with binary neurons are viewed as maps from the vertex set of an n cube to the vertex set of an l cube With only one output neuron in principle they can realize any Boolean function on n inputs We address the problem of determining the necessary and su cient numbers of hidden units for this task by using separability properties of a ne oriented hyperplane a...
متن کاملFrom Polytopes to Enumeration
In the problem session you saw that v-e+f=2 for 3-polytopes. Is something similar true in higher dimensions? Are there other restrictions on the number of faces of each dimension? What is the most number of faces in each dimension if we fix the number of vertices and dimension? The least? What if we fix other numbers of faces in random dimensions? Notice that all of these questions involve coun...
متن کاملOn the Geometry of Toric Arrangements
Motivated by the counting formulas of integral polytopes as in Brion–Vergne [5], [4] and Szenes–Vergne [23], we start to lie the foundations of a theory for toric arrangements, which may be considered as the periodic version of the theory of hyperplane arrangements.
متن کاملRelation Spaces of Hyperplane Arrangements and Modules Defined by Graphs of Fiber Zonotopes
We study the exactness of certain combinatorially defined complexes which generalize the Orlik-Solomon algebra of a geometric lattice. The main results pertain to complex reflection arrangements and their restrictions. In particular, we consider the corresponding relation complexes and give a simple proof of the n-formality of these hyperplane arrangements. As an application, we are able to bou...
متن کاملAdjacency on Combinatorial Polyhedra
This paper shows some useful properties of the adjacency structures of a class of combinatorial polyhedra including the equality constrained 0-1 polytopes. The class of polyhedra considered here includes 0-1 polytopes related to some combinatorial optimization problems; e.g., set partitioning polytopes, set packing polytopes, perfect matching polytopes, vertex packing polytopes and all the face...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 21 شماره
صفحات -
تاریخ انتشار 1999